package 算法模板题;/**
 * @author： li
 * @date： 2022-04-04 17:03
 * @version 1.0
 */
//牛顿迭代思想

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.*;
public class 求立方根 {
    static BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int k =sc.nextInt();
        while(k>0){
            double n = sc.nextDouble();
            double e = 0.00000001;
            double a =Math.sqrt(n);
            double a1 = (2*a+n/a/a)/3;
//            System.out.println(a1);
            while(Math.abs(a1*a1*a1-n)>e){
                a1 = (2*a1+n/a1/a1)/3;
            }
            if(Double.isNaN(a1))
                out.write("0.000\n");
            else
            out.write(String.format("%.3f\n",a1));
            k--;
        }
        //库方法求立方根
//        out.write(String.format("%.3f\n",Math.pow(16,1/3.0)));
        out.flush();
    }
}